Lazy training of radial basis neural networks

Proceeding of: 16th International Conference on Artificial Neural Networks, ICANN 2006. Athens, Greece, September 10-14, 2006Usually, training data are not evenly distributed in the input space. This makes non-local methods, like Neural Networks, not very accurate in those cases. On the other hand, local methods have the problem of how to know which are the best examples for each test pattern. In this work, we present a way of performing a trade off between local and non-local methods. On one hand a Radial Basis Neural Network is used like learning algorithm, on the other hand a selection of the training patterns is used for each query. Moreover, the RBNN initialization algorithm has been modified in a deterministic way to eliminate any initial condition influence. Finally, the new method has been validated in two time series domains, an artificial and a real world one.This article has been financed by the Spanish founded research MEC project OPLINK::UC3M, Ref: TIN2005-08818-C04-0

Preceding rule induction with instance reduction methods

A new prepruning technique for rule induction is presented which applies instance reduction before rule induction. An empirical evaluation records the predictive accuracy and size of rule-sets generated from 24 datasets from the UCI Machine Learning Repository. Three instance reduction algorithms (Edited Nearest Neighbour, AllKnn and DROP5) are compared. Each one is used to reduce the size of the training set, prior to inducing a set of rules using Clark and Boswell's modification of CN2. A hybrid instance reduction algorithm (comprised of AllKnn and DROP5) is also tested. For most of the datasets, pruning the training set using ENN, AllKnn or the hybrid significantly reduces the number of rules generated by CN2, without adversely affecting the predictive performance. The hybrid achieves the highest average predictive accuracy

Klasifikacija dojki prema gustoći izborom značajki

Mammography as an x-ray method usually gives good results for lower density breasts while higher breast tissue densities significantly reduce the overall detection sensitivity and can lead to false negative results. In automatic detection algorithms knowledge about breast density can be useful for setting an appropriate decision threshold in order to produce more accurate detection. Because the overall intensity of mammograms is not directly correlated with the breast density we have decided to observe breast density as a texture classification problem. In this paper we propose breast density classification using feature selection process for different classifiers based on grayscale features of first and second order. In feature selection process different selection methods were used and obtained results show the improvement on overall classification by choosing the appropriate method and classifier. The classification accuracy has been tested on the mini-MIAS database and KBD-FER digital mammography database with different number of categories for each database. Obtained accuracy stretches between 97.2 % and 76.4 % for different number of categories.Mamografija je rendgenska metoda koja daje dobre rezultate pri slikanju dojki koje imaju manju gustoću, dok joj osjetljivost značajno opada pri snimanju dojki veće gustoće i time može doći do lažno pozitivnih rezultata. Poznavanje gustoće dojke može biti korisno kod algoritama za automatsku detekciju zbog mogućnosti određivanja praga odluke na osnovi tog znanja. S obzirom na to da ukupni intenzitet pojedinog mamograma nije izravno povezan s gustoćom, odlučili smo se promatrati gustoću kao problem klasifikacije teksture. U ovom radu predlažemo klasifikaciju dojki prema gustoći izborom izdvojenih značajki intenziteta prvog i drugog reda za različite klasifikatore. Za određivanje prikladnih značajki koristili smo različite metode i tako dobivene značajke pokazale su bolju točnost klasifikacije za odabrane klasifikatore. Točnost klasifikacije testirali smo na bazi mamografskih slika mini-MIAS i bazi digitalnih mamografskih slika KBD-FER s različitim brojem kategorija u koje su slike bile podijeljene. Postignuta točnost klasifikacije proteže se između 97,2 % i 76,4 % za različit broj kategorija u koje su mamogrami podijeljeni

Determining the Trustworthiness of New Electronic Contracts

Expressing contractual agreements electronically potentially allows agents to automatically perform functions surrounding contract use: establish- ment, fulfilment, renegotiation etc. For such automation to be used for real busi- ness concerns, there needs to be a high level of trust in the agent-based system. While there has been much research on simulating trust between agents, there are areas where such trust is harder to establish. In particular, contract proposals may come from parties that an agent has had no prior interaction with and, in competitive business-to-business environments, little reputation information may be available. In human practice, trust in a proposed contract is determined in part from the content of the proposal itself, and the similarity of the content to that of prior contracts, executed to varying degrees of success. In this paper, we argue that such analysis is also appropriate in automated systems, and to provide it we need systems to record salient details of prior contract use and algorithms for as- sessing proposals on their content.We use provenance technology to provide the former and detail algorithms for measuring contract success and similarity for the latter, applying them to an aerospace case study